Optimal in-place suffix sorting

The suffix array is a fundamental data structure for many applications that involve string searching and compression. We obtain the first in-place construction algorithms are optimal both in time space (read-only) integer alphabets. make following contributions: For alphabets, we linear sorting algorithm which uses only O(1) workspace. input may be modified during execution of algorithm, but should restored upon termination algorithm. strengthen result by providing read-only alphabets with |Σ|=O(n) (i.e., cannot modified). This settles open problem posed Franceschini Muthukrishnan ICALP 2007. Besides, general comparisons allowed), present an O(nlog⁡n)